@article{Biagio2009,
author = {Biagio, Andrea Di and Barenghi, Alessandro and Agosta, Giovanni and Pelosi, Gerardo},
doi = {10.1109/IPDPS.2009.5161242},
isbn = {9781424437511},
journal = {Design},
pages = {1--8},
publisher = {IEEE},
title = {{Design of a parallel AES for graphics hardware using the CUDA framework}},
url = {http://ieeexplore.ieee.org/xpls/abs\_all.jsp?arnumber=5161242},
year = {2009}
}
@techreport{Carpenter,
author = {Carpenter, Patrick},
file = {:home/muogoro/Univ/sicurezza/tesina\_gpu/papers/crypto\_gpgpu/security.pdf:pdf},
title = {{Accelerating Cryptographic Primitives with GPUs}},
url = {http://www.auburn.edu/~carpept/security.pdf}
}
@article{Cook2005,
author = {Cook, Debra L and Ioannidis, John and Keromytis, Angelos D and Luck, Jake},
journal = {Computer},
keywords = {aes,block ciphers,graphics processing unit,stream ciphers},
pages = {334--350},
title = {{CryptoGraphics: Secret Key Cryptography Using Graphics Cards}},
url = {http://www.springerlink.com/index/tfuw39p5m15y702q.pdf},
year = {2005}
}
@article{Daemen1999,
abstract = {In this paper we present the block cipher Rijndael, which is one of the fifteen candidate algorithms for the Advanced Encryption Standard (AES). We show that the cipher can be implemented very efficiently on Smart Cards.},
author = {Daemen, Joan and Rijmen, Vincent and Leuven, Katholieke Universiteit},
journal = {Complexity},
pages = {343--348},
publisher = {Citeseer},
title = {{AES Proposal : Rijndael}},
url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.130.4812\&amp;rep=rep1\&amp;type=pdf},
year = {1999}
}
@misc{ElcomSoft,
annote = {free gpu-accelerated md5 hash recovery with linear scalability. lightning hash cracker reverses md5 hashes up to 20 times faster than competition by utilizing nvidia gpus and elcomsoft patent-pending technology to accelerate the recovery.},
author = {ElcomSoft},
file = {:home/muogoro/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Unknown - Unknown - free gpu-accelerated md5 hash recovery.html:html},
keywords = {crack,gpu,lhc,lightning hash cracker,md5,md5 crack,md5 hash password crack,md5 password crack,md5 password cracker,nvidia},
title = {free gpu-accelerated md5 hash recovery},
url = {http://www.elcomsoft.com/lhc.html},
urldate = {14/03/12}
}
@misc{Engine-cuda,
author = {Engine-cuda},
file = {:home/muogoro/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Unknown - Unknown - engine-cuda website.html:html},
title = {engine-cuda website},
url = {http://code.google.com/p/engine-cuda/},
urldate = {14/03/12}
}
@article{Fernando2004,
author = {Fernando, Randy and Harris, Mark and Wloka, Matthias and Zeller, Cyril},
journal = {EUROGRAPHICS Tutorial},
pages = {1--17},
publisher = {Citeseer},
title = {{Programming graphics hardware}},
url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.89.2710\&amp;rep=rep1\&amp;type=pdf},
year = {2004}
}
@misc{Golubev,
author = {Golubev, Ivan},
file = {:home/muogoro/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Unknown - Unknown - About CPU and GPU usage for password recovery.html:html},
title = {{About CPU and GPU usage for password recovery}},
url = {http://www.golubev.com/about\_cpu\_and\_gpu\_2\_en.htm},
urldate = {14/03/12}
}
@article{Harrison2008,
abstract = {This paper presents an analysis of GPU cryptography performance, improving existing implementations. A general cryptography structure is also defined.},
author = {Harrison, Owen and Waldron, John},
institution = {USENIX Association},
journal = {Symposium A Quarterly Journal In Modern Foreign Literatures},
pages = {195--209},
publisher = {USENIX Association},
title = {{Practical symmetric key cryptography on modern graphics hardware}},
url = {http://www.usenix.org/event/sec08/tech/full\_papers/harrison/harrison\_html/},
year = {2008}
}
@article{Harrison2007,
author = {Harrison, Owen and Waldron, John},
doi = {10.1007/978-3-540-74735-2\_15},
editor = {Paillier, Pascal and Verbauwhede, Ingrid},
isbn = {9783540747345},
journal = {Cryptographic Hardware and Embedded Systems CHES 2007},
pages = {209--226},
publisher = {Springer Berlin / Heidelberg},
series = {Lecture Notes in Computer Science},
title = {{AES Encryption Implementation and Analysis on Commodity Graphics Processing Units}},
url = {http://dx.doi.org/10.1007/978-3-540-74735-2\_15},
volume = {4727},
year = {2007}
}
@misc{HashCat,
author = {HashCat},
file = {:home/muogoro/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Unknown - Unknown - hashcat wiki.html:html},
title = {hashcat wiki},
url = {http://hashcat.net/wiki/},
urldate = {14/03/12}
}
@inproceedings{Hongwei2011,
abstract = {Thanks to the development of hardware technology, the Graphics Processing Unit (GPU), as a highly parallel programmable processor, has been applied to more and more advanced mainstream computing systems. In this paper, some optimizations for Message-Digest algorithm 5(MD5) hash reverse were presented, which have been implemented on a GPU parallel architecture called CUDA. The performance of our solution is compared with the implementation running on an AMD II X4 945 four core CPU running at 3.0GHz, and the result shows that our GPU-based MD5 hash reverse implementation is more than ten times faster than an optimized CPU implementation.},
author = {Hongwei, Wu and Xiangnan, Liu and Weibin, Tang},
booktitle = {2011 IEEE International Conference on Anti-Counterfeiting, Security and Identification},
doi = {10.1109/ASID.2011.5967405},
isbn = {978-1-61284-631-6},
month = jun,
pages = {13--16},
publisher = {IEEE},
title = {{A fast GPU-based implementation for MD5 hash reverse}},
url = {http://ieeexplore.ieee.org/xpl/freeabs\_all.jsp?arnumber=5967405},
year = {2011}
}
@article{Hu2009,
author = {Hu, Guang and Huang, Benxiong},
isbn = {9781424451302},
journal = {Optimization},
keywords = {a great extent,combinational use,compute unified,cuda,device architecture,furthermore,gpu,gpu cuda,hash function,improve system performance,md5,takes advantage over hardware only},
title = {{High Throughput Implementation of MD5 Algorithm on GPU}},
year = {2009}
}
@article{Iwai2010,
author = {Iwai, Keisuke and Kurokawa, Takakazu and Nisikawa, Naoki},
doi = {10.1109/IC-NC.2010.49},
isbn = {9781424489183},
journal = {2010 First International Conference on Networking and Computing},
keywords = {aes encoding process,aes encryption implementation},
pages = {209--214},
publisher = {Ieee},
title = {{AES Encryption Implementation on CUDA GPU and Its Analysis}},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=5695236},
year = {2010}
}
@misc{Libgpucrypto,
author = {Libgpucrypto},
file = {:home/muogoro/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Unknown - Unknown - libgpucrypto.html:html},
title = {libgpucrypto},
url = {http://shader.kaist.edu/sslshader/libgpucrypto/},
urldate = {14/03/12}
}
@article{Manavski2007,
abstract = {This paper presents a study of the efficiency in applying modern graphics processing units in symmetric key cryptographic solutions. It describes both traditional style approaches based on the OpenGL graphics API and new ones based on the recent technology trends of major hardware vendors. It presents an efficient implementation of the advanced encryption standard (AES) algorithm in the novel CUDA platform by Nvidia. AES is currently the most widely adopted modern symmetric key encryption standard. The performance of the new fastest GPU solution is compared with those of the reference sequential implementations running on an Intel Pentium IV 3.0 GHz CPU. Unlike previous research in this field, the results of this effort show for the first time the GPU can perform as an efficient cryptographic accelerator. The developed solutions run up to 20 times faster than OpenSSL and in the same range of performance of existing hardware based implementations.},
author = {Manavski, Svetlin A},
doi = {10.1109/ICSPC.2007.4728256},
institution = {IEEE},
isbn = {9781424412358},
issn = {14712105},
journal = {2007 IEEE International Conference on Signal Processing and Communications},
number = {November},
pages = {65--68},
pmid = {18387198},
publisher = {Ieee},
title = {{CUDA Compatible GPU as an Efficient Hardware Accelerator for AES Cryptography}},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=4728256},
volume = {9 Suppl 2},
year = {2007}
}
@book{Menezes1997,
abstract = {Cryptography, in particular public-key cryptography, has emerged in the last 20 years as an important discipline that is not only the subject of an enormous amount of research, but provides the foundation for information security in many applications. Standards are emerging to meet the demands for cryptographic protection in most areas of data communications. Public-key cryptographic techniques are now in widespread use, especially in the financial services industry, in the public sector, and by individuals for their personal privacy, such as in electronic mail. This Handbook will serve as a valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography. It is a necessary and timely guide for professionals who practice the art of cryptography.The Handbook of Applied Cryptography provides a treatment that is multifunctional: It serves as an introduction to the more practical aspects of both conventional and public-key cryptography It is a valuable source of the latest techniques and algorithms for the serious practitioner It provides an integrated treatment of the field, while still presenting each major topic as a self-contained unit It provides a mathematical treatment to accompany practical discussions It contains enough abstraction to be a valuable reference for theoreticians while containing enough detail to actually allow implementation of the algorithms discussedNow in its third printing, this is the definitive cryptography reference that the novice as well as experienced developers, designers, researchers, engineers, computer scientists, and mathematicians alike will use.},
author = {Menezes, Alfred J and Oorschot, Paul C Van and Vanstone, Scott A},
booktitle = {Electrical Engineering},
chapter = {9},
isbn = {0849385237},
number = {2},
pages = {780},
pmid = {21484984},
publisher = {CRC Press},
series = {The CRC Press series on discrete mathematics and its applications},
title = {{Handbook of Applied Cryptography}},
url = {http://www.cacr.math.uwaterloo.ca/hac/index.html},
volume = {106},
year = {1997}
}
@book{Munshi2011a,
author = {Munshi, Aaftab and Gaster, Benedict and Mattson, Timothy G. and Fung, James and Ginsburg, Dan},
isbn = {0321749642},
pages = {648},
publisher = {Addison Wesley},
title = {{OpenCL Programming Guide (OpenGL)}},
url = {http://www.amazon.co.uk/OpenCL-Programming-OpenGL-Aaftab-Munshi/dp/0321749642},
year = {2011}
}
@inproceedings{Neelima2010,
abstract = {With the growth of Graphics Processor (GPU) programmability and processing power, graphics hardware has become a compelling platform for computationally demanding tasks in a wide variety of application domains. This state of art paper gives the technical motivations that underlie GPU computing and describe the hardware and software developments that have led to the recent interest in this field.},
author = {Neelima, B and Raghavendra, Prakash S},
booktitle = {Architecture},
doi = {10.1109/ICIINFS.2010.5578685},
isbn = {9781424466511},
keywords = {dr,gpu,gpu computing,graphics processor,prakash s raghavendra},
pages = {319--324},
publisher = {IEEE},
title = {{Recent trends in software and hardware for GPGPU computing: A comprehensive survey}},
url = {http://ieeexplore.ieee.org/xpl/freeabs\_all.jsp?arnumber=5578685},
year = {2010}
}
@article{Nvidia2010,
abstract = {Data from a hospital-based matched case-control study with 531 male pairs were analyzed for risks of cancer of the lower urinary tract associated with previous employment and particular occupational exposures. Statistically significant odds ratios were obtained for ever-employment as mining workers (2.0), turners (2.3), tailors (2.7), truck drivers (1.8), locomotive drivers (3.0) and janitors (3.5), whereas odds ratios of 3.0 or more, found for rubber and plastics workers, printing workers, gas workers, artists and chemists were not statistically significant. When adjusted for smoking, there was a trend toward increasing relative risks with increasing duration of employment as truck drivers and as turners, and relative risks rose 3-fold for 30 or more years of employment. With regard to a priori high-risk industries, ever-employment in the rubber, plastics and synthetics, dyestuff and paints, mining, and printing industries and secondary processing was associated with significantly higher relative risks, and a statistically significant trend in risk with increasing duration of employment was found for the first 3 industries mentioned. With regard to job-related exposures to specified substances, the relative risks observed for increasing duration of exposure suggest that exposures to petroleum, oils, chromium/chromate, spray paints, and zinc, which correspond to exposures involved in the occupations showing a higher relative risk in this study, are associated with a higher risk for cancer of the lower urinary tract.},
author = {Nvidia},
institution = {NVIDIA},
issn = {00207136},
journal = {NVIDIA},
number = {3},
pages = {371--379},
pmid = {3346100},
publisher = {NVIDIA},
title = {{OpenCL Programming Guide for the CUDA Architecture}},
url = {http://www.ncbi.nlm.nih.gov/pubmed/3346100},
volume = {41},
year = {2010}
}
@article{Nvidia2010a,
author = {Nvidia},
journal = {Optimization},
pages = {1--54},
publisher = {NVidia},
title = {{OpenCL Best Practices Guide}},
url = {http://developer.download.nvidia.com/compute/cuda/3\_2\_prod/toolkit/docs/OpenCL\_Best\_Practices\_Guide.pdf},
year = {2010}
}
@article{Owens2007,
abstract = {The rapid increase in the performance of graphics hardware, coupled with recent improvements in its programmability, have made graphics hardware a compelling platform for computationally demanding tasks in a wide variety of application domains. In this report, we describe, summarize, and analyze the latest research in mapping general-purpose computation to graphics hardware. We begin with the technical motivations that underlie general-purpose computation on graphics processors (GPGPU) and describe the hardware and software developments that have led to the recent interest in this field. We then aim the main body of this report at two separate audiences. First, we describe the techniques used in mapping general-purpose computation to graphics hardware. We believe these techniques will be generally useful for researchers who plan to develop the next generation of GPGPU algorithms and techniques. Second, we survey and categorize the latest developments in general-purpose application development on graphics hardware.},
author = {Owens, John D and Luebke, David and Govindaraju, Naga and Harris, Mark and Kr\"{u}ger, Jens and Lefohn, Aaron E and Purcell, Timothy J},
doi = {10.1111/j.1467-8659.2007.01012.x},
editor = {Redish, Edward F and Rigden, John S},
file = {:home/muogoro/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Owens et al. - 2007 - A Survey of General-Purpose Computation on Graphics Hardware(3).pdf:pdf},
institution = {John Wiley \& Sons},
isbn = {9781595938824},
issn = {01677055},
journal = {Computer Graphics Forum},
number = {1},
pages = {80--113},
publisher = {Citeseer},
series = {ASE '07},
title = {{A Survey of General-Purpose Computation on Graphics Hardware}},
url = {http://doi.wiley.com/10.1111/j.1467-8659.2007.01012.x},
volume = {26},
year = {2007}
}
@misc{RainbowCrack,
author = {RainbowCrack},
file = {:home/muogoro/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Unknown - Unknown - RainbowCrack Project - Crack Hashes with Rainbow Tables.html:html},
title = {{RainbowCrack Project - Crack Hashes with Rainbow Tables}},
url = {http://project-rainbowcrack.com/},
urldate = {14/03/12}
}
@misc{Rivest1992,
abstract = {This document describes the MD5 message-digest algorithm. The algorithm takes as input a message of arbitrary length and produces as output a 128-bit "fingerprint" or "message digest" of the input. It is conjectured that it is computationally infeasible to produce two messages having the same message digest, or to produce any message having a given prespecified target message digest. The MD5 algorithm is intended for digital signature applications, where a large file must be "compressed" in a secure manner before being encrypted with a private (secret) key under a public-key cryptosystem such as RSA. The MD5 algorithm is designed to be quite fast on 32-bit machines. In addition, the MD5 algorithm does not require any large substitution tables; the algorithm can be coded quite compactly. The MD5 algorithm is an extension of the MD4 message-digest algorithm 1,2. MD5 is slightly slower than MD4, but is more "conservative" in design. MD5 was designed because it was felt that MD4 was perhaps being adopted for use more quickly than justified by the existing critical review; because MD4 was designed to be exceptionally fast, it is "at the edge" in terms of risking successful cryptanalytic attack. MD5 backs off a bit, giving up a little in speed for a much greater likelihood of ultimate security. It incorporates some suggestions made by various reviewers, and contains additional optimizations. The MD5 algorithm is being placed in the public domain for review and possible adoption as a standard. For OSI-based applications, MD5's object identifier is md5 OBJECT IDENTIFIER iso(1) member-body(2) US(840) 5 In the X.509 type AlgorithmIdentifier 3, the parameters for MD5 should have type NULL.},
author = {Rivest, R},
booktitle = {Technical report httptoolsietforghtmlrfc1321},
institution = {Internet Activities Board},
title = {{RFC 1321: The MD5 Message-Digest Algorithm}},
url = {ftp://ftp.internic.net/rfc/rfc1321.txt,},
year = {1992}
}
@misc{SalmanUlHaq2011,
author = {{Salman Ul Haq}, Jawad Masood, Aamir Majeed, Usman Aziz},
title = {{Bulk Encryption on GPUs}},
url = {http://developer.amd.com/documentation/articles/pages/BulkEncryptiononGPUs.aspx},
urldate = {21 febbraio 2012},
year = {2011}
}
@book{Sanders2010,
abstract = {"This book is required reading for anyone working with accelerator-based computing systems." -From the Foreword by Jack Dongarra, University of Tennessee and Oak Ridge National Laboratory CUDA is a computing architecture designed to facilitate the development of parallel programs. In conjunction with a comprehensive software platform, the CUDA Architecture enables programmers to draw on the immense power of graphics processing units (GPUs) when building high-performance applications. GPUs, of course, have long been available for demanding graphics and game applications. CUDA now brings this valuable resource to programmers working on applications in other domains, including science, engineering, and finance. No knowledge of graphics programming is required-just the ability to program in a modestly extended version of C. CUDA by Example, written by two senior members of the CUDA software platform team, shows programmers how to employ this new technology. The authors introduce each area of CUDA development through working examples. After a concise introduction to the CUDA platform and architecture, as well as a quick-start guide to CUDA C, the book details the techniques and trade-offs associated with each key CUDA feature. You'll discover when to use each CUDA C extension and how to write CUDA software that delivers truly outstanding performance. Major topics covered include Parallel programmingThread cooperationConstant memory and eventsTexture memoryGraphics C on multiple GPUsAdvanced atomicsAdditional CUDA resources All the CUDA software tools you'll need are freely available for download from NVIDIA. http://developer.nvidia.com/object/cuda-by-example.html},
author = {Sanders, Jason and Kandrot, Edward},
booktitle = {Review Literature And Arts Of The Americas},
chapter = {4},
doi = {10.1073/pnas.1010880108/-/DCSupplemental.www.pnas.org/cgi/},
isbn = {9780131387683},
issn = {1873734X},
number = {2},
pages = {279},
pmid = {18701313},
publisher = {Addison-Wesley},
title = {{CUDA by Example}},
url = {http://wwwzb.fz-juelich.de/contentenrichment/inhaltsverzeichnisse/2010/9780131387683.pdf},
volume = {54},
year = {2010}
}
@book{Stallings2010,
author = {Stallings, William},
booktitle = {Network Security},
isbn = {9780136097044},
pages = {899},
pmid = {16431879},
publisher = {Prentice Hall},
title = {{Cryptography and Network Security: Principles and Practice}},
url = {http://books.google.com/books?id=wwfTvrWEKVwC},
year = {2010}
}
@article{Tzeng2008,
abstract = {A good random number generator is essential for many graphics applications. As more such applications move onto parallel processing, it is vital that a good parallel random number generator be used. Unfortunately, most random number generators today are still sequential, exposing performance bottlenecks and denying random accessibility for parallel computations. Furthermore, popular parallel random number generators are still based off sequential methods and can exhibit statistical bias. In this paper, we propose a random number generator that maps well onto a parallel processor while possessing white noise distribution. Our generator is based on cryptographic hash functions whose statistical robustness has been examined under heavy scrutiny by cryptologists. We implement our generator as a GPU pixel program, allowing us to compute random numbers in parallel just like ordinary texture fetches: given a texture coordinate per pixel, instead of returning a texel as in ordinary texture fetches, our pixel program computes a random noise value based on this given texture coordinate. We demonstrate that our approach features the best quality, speed, and random accessibility for graphics applications.},
author = {Tzeng, Stanley and Wei, Li-Yi},
doi = {10.1145/1342250.1342263},
isbn = {9781595939838},
journal = {Proceedings of the 2008 symposium on Interactive 3D graphics and games SI3D 08},
keywords = {computation,gpu techniques,noise,parallel,random number generation,texturing},
number = {212},
pages = {79},
publisher = {ACM Press},
title = {{Parallel white noise generation on a GPU via cryptographic hash}},
url = {http://portal.acm.org/citation.cfm?doid=1342250.1342263},
volume = {1},
year = {2008}
}
@inproceedings{Vu2011,
abstract = {From the early days of computing, passwords have been considered as the essential authentication method to protect accesses to computer systems and users. Due to their importance, sensitiveness and confidentiality, many cryptography mechanisms have been utilized to secure password storage. Among them, cryptography hash methods are the most popular solutions. A cryptography hash function converts plaintext passwords to unreadable message digests which frustrates attackers from exploiting system failures and stealing stored passwords. On the other hand, it is possible to get the plaintext passwords from digests. We examined brute force attack to get the original passwords from the hashed ones and studied some existing GPU-based brute force cracking tools. These applications implement a hybrid algorithm that generates available passwords on CPU side and hashes them in parallel on GPU side. In this paper, we propose a new homogeneous parallel brute force cracking algorithm that performs all the works on GPU side. In our experiments, we successfully cracked many kinds of passwords. For example, with 6-digit passwords, it took about 0.23 ms for initialization, 1.97 ms for combination generation, and 52.81 ms for brute-force. So we need less than 1 second to crack passwords of this kind.},
author = {Vu, Anh-Duy and Han, Jea-Il and Nguyen, Hong-An and Kim, Young-Man and Im, Eun-Jin},
booktitle = {ICTC 2011},
doi = {10.1109/ICTC.2011.6082661},
isbn = {978-1-4577-1268-5},
month = sep,
pages = {561--564},
publisher = {IEEE},
title = {{A homogeneous parallel brute force cracking algorithm on the GPU}},
url = {http://ieeexplore.ieee.org/xpl/freeabs\_all.jsp?arnumber=6082661},
year = {2011}
}
@article{Wu2008,
abstract = {By a rapid development of Graphics Processing Unit (GPU) in recent years, the programmability and highly parallel processing feature of GPU create a chance to allow the general purpose computation to be conducted on GPU, conventionally called GPGPU(General Purpose computation on GPU). A brief the GPGPU, is rationale of how the GPU architecture introduced in this survey, in particular on leads paper, and various applications by taking advantage of GPGPU computation, including our works in this field on fluid simulation, as well as the works to be presented in this special session are also introduced.},
author = {Wu, Enhua},
doi = {10.1109/APCCAS.2008.4746099},
isbn = {9781424423415},
journal = {APCCAS 2008 2008 IEEE Asia Pacific Conference on Circuits and Systems},
keywords = {general purpose computation,gpgpu,graphics hardw},
number = {60773030},
pages = {618--622},
publisher = {Ieee},
title = {{Emerging technology about GPGPU}},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=4746099},
year = {2008}
}
@article{Zhou2009,
author = {Zhou, Wenchao and Wu, Hongwei and Li, Xiaochao and Guo, Donghui},
doi = {10.1109/ICASID.2009.5277017},
isbn = {9781424438839},
journal = {2009 3rd International Conference on Anticounterfeiting Security and Identification in Communication},
keywords = {frequent data access,gpu,hardware acceleration,md4 family,so,suitable},
pages = {571--574},
publisher = {Ieee},
title = {{Implementations of hardware acceleration for MD4-family algorithms based on GPU}},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=5277017},
year = {2009}
}
@misc{PCI-SIG,
author = {PCI-SIG},
file = {:home/muogoro/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Unknown - Unknown - PCI-SIG - FAQ - PCI Express 3.0.html:html},
title = {{PCI-SIG - FAQ - PCI Express 3.0}},
url = {http://www.pcisig.com/news\_room/faqs/pcie3.0\_faq/},
urldate = {16/09/12}
}
@misc{AMD,
author = {AMD},
file = {:home/muogoro/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Unknown - Unknown - AMD Fusion Architecture and Llano.html:html},
title = {{AMD Fusion Architecture and Llano}},
url = {http://www.realworldtech.com/fusion-llano/2/},
urldate = {16/09/12}
}
